Two Diophantine Approaches to the Irreducibility of Certain Trinomials

نویسندگان

  • M. Filaseta
  • F. Luca
  • R. G. Underwood
چکیده

In the previous paper [FLSU], we determined the Galois groups associated with some polynomials constructed through the use of circulant matrices. In the process of determining the Galois groups, the irreducibility of the trinomial x + x +m was established, where p represents an odd prime and m an integer ≥ 2. The approach there was based on a method of Lebesgue [Le]. In this paper, we discuss two other approaches we discovered in our investigations, both relying on the nice work of Bilu, Hanrot, and Voutier [BHV] (with an appendix by Mignotte) on Lucas and Lehmer numbers. In the next section, we consider the more general polynomials tp(x) = x +bx+c where b and c are nonzero integers. There are four cases where reducibility is easily established:

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Algorithm for Generating Irreducible Cubic Trinomials over Prime Field

This paper proposes an algorithm for generating irreducible cubic trinomials in the form x + ax + b, b ∈ Fp, where a is a certain fixed non-zero element in the prime field Fp. The proposed algorithm needs a certain irreducible cubic trinomial over Fp to be previously given as a generator; however, the proposed algorithm can generate irreducible cubic polynomials one after another by changing a ...

متن کامل

A Fast Algorithm for Testing Irreducibility of Trinomials

The standard algorithm for testing reducibility of a trinomial of prime degree r over GF(2) requires 2r+O(1) bits of memory and Θ(r) bit-operations. We describe an algorithm which requires only 3r/2 + O(1) bits of memory and significantly fewer bit-operations than the standard algorithm. Using the algorithm, we have found 18 new irreducible trinomials of degree r in the range 100151 ≤ r ≤ 70005...

متن کامل

Ten new primitive binary trinomials

We exhibit ten new primitive trinomials over GF(2) of record degrees 24 036 583, 25 964 951, 30 402 457, and 32 582 657. This completes the search for the currently known Mersenne prime exponents. Primitive trinomials of degree up to 6 972 593 were previously known [4]. We have completed a search for all known Mersenne prime exponents [7]. Ten new primitive trinomials were found. Our results ar...

متن کامل

On the factorization of polynomials with small Euclideannorm

Throughout this paper, we refer to the non-cyclotomic part of a polynomial f(x) 2 Z[x] as f(x) with its cyclotomic factors removed. More speci cally, if g1(x); : : : ; gr(x) are non-cyclotomic irreducible polynomials in Z[x] and gr+1(x); : : : ; gs(x) are cyclotomic polynomials such that f(x) = g1(x) gr(x) gr+1(x) gs(x), then g1(x) gr(x) is the non-cyclotomic part of f(x). We refer to a polynom...

متن کامل

Estimating isogenies on elliptic curves

The object of this paper is to prove a new type of estimate for isogenies between elliptic curves. This has several diophantine applications (effective versions of Serre's Galois irreducibility theorem and Shafarevich's theorem, for example) which are presented in another paper [MW3]. Later articles will deal with the corresponding problems for abelian varieties of arbitrary dimension. Right at...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006